package com.geticsen.leetcode;

public class Solution_1893 {
    public boolean isCovered(int[][] ranges, int left, int right) {
        boolean isCover = false;
        for (int i = left; i <= right; i++) {
            isCover = false;
            for (int[] range : ranges) {
                if (range[0] <= i && range[1] >= i) {
                    isCover = true;
                    break;
                }
            }
            if (!isCover) {
                break;
            }
        }
        return isCover;
    }
}
